A Profile-based Friend Detection Scheme for Online Social Networks

ثبت نشده
چکیده

In past few years, users created friends with every other World Health Organization live or work near them, like neighbor or work place etc. this kind of friendly relationship is named as ancient means of constructing friends or G. Friend referred to as geographical primarily based friends .Now social networking services recommend friends to users based on their social graphs, which may not be the most accurate in friend selection. An efficient friend recommendation system for social networks, which recommends friends to users based on their life styles instead of social graphs. It can be applicable in smart phones, discovers life styles of users from user-centric sensor data, measures the similarity of life styles between users, and recommends friends to users if their life styles have high similarity. We adopt Latent Dirichlet Allocation algorithm for lifestyle extraction. Similarity metric to measure the similarity of life styles between users, and calculate user’s Impact in terms of life styles. Also have a feedback mechanism to improve recommendation accuracy. In this paper, we propose a trust-based friend recommendation scheme for OSNs, where OSN users apply their attributes to find matched friends, and establish social relationships with strangers via a multi-hop trust chain. Based on trace-driven experimental results and security analysis.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Detection Techniques of Clone Attack on Online Social Networks: Survey and Analysis

Online social network presents a wide variety of online uses that exhibit a series of challenges to the security. The security and privacy threats increase, as the amount of personal information posted by users in their profile is made public. Social networking provides interaction and socialization among users which generates large amount of data. This necessitates the adoption of new tools an...

متن کامل

Mining Overlapping Communities in Real-world Networks Based on Extended Modularity Gain

Detecting communities plays a vital role in studying group level patterns of a social network and it can be helpful in developing several recommendation systems such as movie recommendation, book recommendation, friend recommendation and so on. Most of the community detection algorithms can detect disjoint communities only, but in the real time scenario, a node can be a member of more than one ...

متن کامل

Friends’ Recommendations in Social Networks: An Online Lifestyles Approach

Several of the existing major social networking services such as Facebook and Twitter, recommend friends to their users based on social graphs analysis, or using simple friend recommendation algorithms such as similarity, popularity, or the “friend's friends are friends,” concept. However these approaches, even though intuitive and quick, they consider few of the characteristics of the social n...

متن کامل

User Identification across Social Networks using the Web Profile and Friend Network

Today, it is common that people are users of more than one social network and their friends may also be registered on multiple websites. A facility to aggregate our online friends into a single integrated environment would enable us to keep up-to-date with our virtual contacts more easily, as well as to provide improved facility to search for users across different websites. In this paper, we p...

متن کامل

"With a little help from new friends": Boosting information cascades in social networks based on link injection

We investigate information cascades in the context of viral marketing applications. Recent research has identified that communities in social networks may hinder cascades. To overcome this problem, we propose a novel method for injecting social links in a social network, aiming at boosting the spread of information cascades. Unlike the proposed approach, existing link prediction methods do not ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016